Rectangle-visibility Layouts of Unions and Products of Trees
نویسندگان
چکیده
The paper considers representations of unions and products of trees as rectangle-visibility graphs (abbreviated RVGs), i.e., graphs whose vertices are rectangles in the plane, with adjacency determined by horizontal and vertical visibility. Our main results are that the union of any tree (or forest) with a depth-1 tree is an RVG, and that the union of two depth-2 trees and the union of a depth-3 tree with a matching are subgraphs of RVGs. We also show that the cartesian product of two forests is an RVG. Communicated by J. S. B. Mitchell: submitted January 1998; revised September 1998. A. Dean and J. Hutchinson, RVG Layouts , JGAA, 2(8) 1–21 (1998) 2
منابع مشابه
Area Requirement of Visibility Representations of Trees
We study the area requirement of bar-visibility and rectangle-visibility representations of trees in the plane. We prove asymptotically tight lower and upper bounds on the area of such representations, and give linear-time algorithms that construct representations with asymptotically optimal area. @ 1997 Elsevier Science B.V.
متن کاملVisibility Drawings of Plane 3-Trees with Minimum Area
A visibility drawing of a plane graph G is a drawing of G where each vertex is drawn as a horizontal line segment and each edge is drawn as a vertical line segment such that the line segments use only grid points as their endpoints. The area of a visibility drawing is the area of the smallest rectangle on the grid which encloses the drawing. A minimum-area visibility drawing of a plane graph G ...
متن کاملParallel h - v Drawings of Binary Trees ? Panagiotis
In this paper we present a method to obtain optimal h-v and inclusion drawings in parallel. Based on parallel tree contraction, our method computes optimal (with respect to a class of cost functions of the enclosing rectangle) drawings in O(log 2 n) parallel time by using a polynomial number of EREW processors. The method can be extended to compute optimal inclusion layouts in the case where ea...
متن کاملRectangle-Visibility Representations of Bipartite Graphs
The paper considers representations of bipartite graphs as rectangle-visibility graphs, Le., graphs whose vertices are rectangles in the plane, with adjacency detenmned by horizontal and vertical visibility.1t is shown that, for p ~ q, Kp,q has a representation with no rectangles having collinear sides if and only if p ~ 2 or p = 3 and q ~ 4. More generally, it is shown that Kp;q is a rectangle...
متن کاملTrade :union:s, trade :union: movement, trade :union:s, political sphere of Iran
The research, which is written using the approach of historical sociology and descriptive and analytical methods, examines the interactions of trade unions after the Islamic Revolution. The examinations show that the first trade unions or trade unions emerged in England in the early eighteenth century. In Iran, too, the tendency towards trade unions is related to the years before the Constituti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Graph Algorithms Appl.
دوره 2 شماره
صفحات -
تاریخ انتشار 1998